Evaluating Code Coverage of Assertions by Static Analysis of Rtl

نویسندگان

  • Viraj Athavale
  • Sam Hertz
  • Shobha Vasudevan
چکیده

Assertions are critical in pre-silicon hardware verification to ensure expected design behavior. While Register Transfer Level (RTL) code coverage can provide a metric for assertion quality, few methods to report it currently exist. We introduce two practical and effective code coverage metrics for assertions one inspired by test suite code coverage as reported by RTL simulators and the other by assertion correctness in the context of formal verification. We present an algorithm to compute coverage with respect to assertion correctness, by analyzing the Control Flow Graph (CFG) constructed from the RTL source code. Our technique reports coverage in terms of lines of RTL source code which is easier to interpret and can help in efficiently enhancing an assertion suite. We apply our technique to an open source USB 2.0 design and show that our coverage evaluation is efficient and scalable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Goldmine : an Integration of Data Mining and Static Analysis for Automatic Generation of Hardware

We present GOLDMINE, a methodology for generating assertions automatically. Our method involves a combination of data mining and static analysis of the Register Transfer Level (RTL) design. The RTL design is first simulated to generate data about the design’s dynamic behavior. The generated data is then mined for “candidate assertions” that are likely to be invariants. We present both a decisio...

متن کامل

Mining High Quality Assertions Using Best-Gain Decision Forests

We introduce the Best-Gain Decision Forest algorithm, an assertion mining methodology that generates high quality assertions. Our methodology uses static analysis and a novel machine learning technique to mine assertions from register-transfer level (RTL) simulation traces. Our machine learning technique is inspired by decision tree algorithms and generates concise, high coverage RTL assertions...

متن کامل

GoldMine: Automatic Assertion Generation and Coverage Closure in Design Validation

We present GOLDMINE, a methodology for generating assertions automatically. Our method involves a combination of data mining and static analysis of the Register Transfer Level (RTL) design. The RTL design is first simulated to generate data about the design’s dynamic behavior. The generated data is then mined for ”candidate assertions” that are likely to be invariants. These candidate assertion...

متن کامل

Assertion Based Functional Verification of MBIST Controller Using Coverage Analysis

For the functional validation of hardware designs, simulation with coverage analysis is still the primary means at RTL description of design. Here coverage analysis shows the way towards the optimal use of resource, validation or verification completeness and untested areas of HDL design. The complete coverage analysis of Memory Built in Self-Test (MBIST) controller using several code and funct...

متن کامل

Using SystemVerilog Assertions in Gate-Level Verification Environments

Real-world requirements such as multiple clock domains and low-power modes of operation, including frequency and voltage scaling, often necessitate gate-level System-on-Chip (SoC) verification environments to complement the standard RTL based simulations. If the verification environment relies on assertion-based checkers to validate grey-box operation then gate-level simulations will also benef...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011